Elasticity of factorization in number fields

Polynomial factorization algorithms over number fields

Factorization algorithms over Q[X] and Fp[X] are key tools of computational number theory. Many algorithms over number fields rely on the possibility of factoring polynomials in those fields. Because of the recent development of relative methods in computational number theory, see for example (Cohen et al. 1998, Daberkow and Pohst 1995), efficient generalizations of factorization algorithms to ...

Applications of Prime Factorization of Ideals in Number Fields

For a number fieldK, that is, a finite extension of Q, and a prime number p, a fundamental theorem of algebraic number theory implies that the ideal (p) ⊆ OK factors uniquely into prime ideals as (p) = p1 1 · · · p eg g . In this paper we explore different interpretations of this using the factorization of polynomials in finite and p-adic fields and Galois theory. In particular, we present some...

Non-unique Factorization and Principalization in Number Fields

Following what is basically Kummer’s relatively neglected approach to non-unique factorization, we determine the structure of the irreducible factorizations of an element n in the ring of integers of a number field K. Consequently, we give a combinatorial expression for the number of irreducible factorizations of n in the ring. When K is quadratic, we show in certain cases how quadratic forms c...

Uniqueness of Factorization in Quadratic Fields

control of the optical properties of nanoparticles by laser fields

در این پایان نامه، درهمتنیدگی بین یک سیستم نقطه کوانتومی دوگانه(مولکول نقطه کوانتومی) و میدان مورد مطالعه قرار گرفته است. از آنتروپی ون نیومن به عنوان ابزاری برای بررسی درهمتنیدگی بین اتم و میدان استفاده شده و تاثیر پارامترهای مختلف، نظیر تونل زنی(که توسط تغییر ولتاژ ایجاد می شود)، شدت میدان و نسبت دو گسیل خودبخودی بر رفتار درجه درهمتنیدگی سیستم بررسی شده اشت.با تغییر هر یک از این پارامترها، در...